Ritt - Wu ’ s Decomposition Algorithm ∗
نویسندگان
چکیده
An improved Ritt-Wu’s decomposition (of an algebraic set into the union of irreducible varieties) algorithm is given. The algorithm has been used to prove geometric theorems that Wu’s original method addresses. Unlike Wu’s original approach, nondegenerate conditions are given explicitly at the beginning, not generated during the proof process. A program based on this improved version of the algorithm proved more than 500 theorems, including Morley’s trisector theorem.
منابع مشابه
Prime Decompositions of Radicals in Polynomial Rings
In the last twenty years several methods for computing primary decompositions of ideals in multivariate polynomial rings over fields (Seidenberg (1974), Lazard (1985), Kredel (1987), Eisenbud et al. (1992)), the integers (Seidenberg, 1978), factorially closed principal ideal domains (Ayoub (1982), Gianni et al. (1988)) and more general rings (Seidenberg, 1984) have been proposed. A related prob...
متن کاملFactorization-free Decomposition Algorithms in Differential Algebra
This paper makes a contribution to differential elimination and more precisely to the problem of computing a representation of the radical differential ideal generated by a system of differential equations (ordinary or partial). The approach we use here involves characteristic set techniques;‡ these were introduced by J. F. Ritt, the founder of differential algebra. The basic idea is to write t...
متن کاملar X iv : 0 80 9 . 11 28 v 1 [ m at h . A C ] 6 S ep 2 00 8 ON THE GENERALISED RITT PROBLEM AS A COMPUTATIONAL PROBLEM
The Ritt problem asks if there is an algorithm that tells whether one prime differential ideal is contained in another one if both are given by their characteristic sets. We give several equivalent formulations of this problem. In particular, we show that it is equivalent to testing if a differential polynomial is a zero divisor modulo a radical differential ideal. The technique used in the pro...
متن کاملEssential Components of an Algebraic Differential Equation
We present an algorithm to determine the set of essential singular solutions of a differential equation. Essential singular solutions can be informally described as follows: the general solution of a differential equation is usually described as a solution depending on a number of arbitrary constants equal to the order of the differential equation. The essential singular solutions are those tha...
متن کاملOn Ritt’s Polynomial Decomposition Theorems
Ritt studied the functional decomposition of a univariate complex polynomial f into prime (indecomposable) polynomials, f = u1 ◦ u2 ◦ · · · ◦ ur. His main achievement was a procedure for obtaining any decomposition of f from any other by repeatedly applying certain transformations. However, Ritt’s results provide no control on the number of times one must apply the basic transformations, which ...
متن کامل